An improved error bound for linear complementarity problems for B-matrices
نویسندگان
چکیده
منابع مشابه
An improved error bound for linear complementarity problems for B-matrices
A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in (Li et al. in Electron. J. Linear Algebra 31(1):476-484, 2016). In addition some sufficient conditions such that the new bound is sharper than that in (García-Esnaola and Peña in Appl. Math. Lett. 22(7):1071-1075, 2009) are provided.
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملimproved infeasible-interior-point algorithm for linear complementarity problems
we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...
متن کاملError bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices
In this paper, new error bounds for the linear complementarity problem are obtained when the involved matrix is a weakly chained diagonally dominant B-matrix. The proposed error bounds are better than some existing results. The advantages of the results obtained are illustrated by numerical examples.
متن کاملEnclosing Solutions of Linear Complementarity Problems for H-Matrices
The paper establishes a computational encIosure of the solution of the linear complementarity problem (q, M), where M is assumed to be an H-matrix with a positive main diagonal. A dass of problems with interval data, which can arise in approximating the solutions of free boundary problems, is also treated successfully.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2017
ISSN: 1029-242X
DOI: 10.1186/s13660-017-1414-z